Improved Arbitrary size Benes Network
نویسندگان
چکیده
Multistage interconnection networks (MINs) are used to connect N inputs to N outputs. They are mainly used to connect processor to processor and for processor to memory in distributed and shared memory environment. The MINs are broadly divided into three categories Blocking Non Blocking and Rearrangeable networks. A new improved Arbitrary size Benes network has been proposed in this to improve the permutation capabilities and to reduce the cost of existing Arbitrary Size Benes Network.
منابع مشابه
Arbitrary Size Benes Networks
The Benes network is a rearrangeable nonblocking network which can realize any arbitrary permutation. Overall, the r-dimensional Benes network connects 2 r inputs to 2 r outputs through 2r ? 1 levels of 2 2 switches. Each level of switches consists of 2 r?1 switches, and hence the size of the network has to be a power of two. In this paper, we extend Benes networks to arbitrary sizes. We also s...
متن کاملTwo-bounce optical arbitrary permutation network.
The two-bounce free-space arbitrary interconnection architecture is presented. It results from a series of three-dimensional topological transformations to the Benes network, the minimum rearrangeable nonblocking network. Although functionally equivalent to the Benes network, it requires only two stages of global (spanning multiple chips) optical interconnections. The remaining stages of the mo...
متن کاملThe KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network based on K-bounded Permutations
The Benes network has been used as a rearrangeable network for over 30 years for applications in circuit switching and packet routing. However the O(N logN) control complexity of the Benes is not optimal for many permutations. In this paper, we present a novel rearrangeable network that is permutation-specific control-optimal, i.e., it has the lowest control complexity for every input permutati...
متن کاملThe KR-Benes Network: A (almost) Control-Optimal Rearrangeable Permutation Network
In this paper, we solve a longstanding open problem on the design of optimal rearrangeable networks. Networks such as the Benes [1] have been used for over 40 years, yet the uniform N(2 logN − 1) control complexity of the N × N Benes is not optimal for many permutations. To the best of our knowledge, there are no results in the literature that improve this control complexity. In this paper, we ...
متن کاملLiterature Survey of nonblocking network topologies
The performance of a parallel computer greatly depends upon how, the different processors are capable of exchanging data. This, thus require an arbitrary permutation (nonblocking) to be done by the connection networks. A nonblocking network is capable of providing N parallel paths between a pair of nodes forming any arbitrary permutation. In this paper, we present three different simple nonbloc...
متن کامل